#define  _CRT_SECURE_NO_WARNINGS
#include "sort.h"


int main()
{
	int arr[] = { 5, 3, 9, 6, 2, 4, 7, 1, 8 };
	int n = sizeof(arr) / sizeof(int);
	
	//SelectSort(arr, n);
	//ShellSort(arr, n);

	//HeapSort(arr,n);
	// 
	//QuickSort3(arr, 0,n - 1);
	//QuickSort2(arr, 0,n - 1);
	//QuickSort1(arr, 0,n - 1);

	//stack st;
	//st.QuickSort(arr, 0, n - 1);
	//st1.Push(1);
	//st1.Push(2);
	//st1.Push(3);
	//st1.Push(4);
	//st1.Push(5);
	//st1.Pop();
	//std::cout<< st1.Top();
	//st1.print();

	QuickSort(arr, 0, n-1);


	print(arr, n);

	return 0;
}

